Star-Shaped and L-Shaped Orthogonal Drawings

نویسندگان

  • Xin He
  • Dayu He
چکیده

An orthogonal drawing of a plane graph G is a planar drawing of G, denoted by D(G), such that each vertex of G is drawn as a point on the plane, and each edge of G is drawn as a sequence of horizontal and vertical line segments with no crossings. An orthogonal polygon P is called orthogonally convex if the intersection of any horizontal or vertical line L and P is either a single line segment or empty. An orthogonal drawing D(G) is called orthogonally convex if all of its internal faces are orthogonally convex polygons. An orthogonal polygon P is called a star-shaped polygon if there is a point p ∈ P such that the entire P is visible from p. An orthogonal drawing D(G) is called a star-shaped orthogonal drawing (SSOD) if all of its internal faces are star-shaped polygons. Every SSOD is an orthogonally convex drawing, but the reverse is not true. SSOD is visually more appealing than orthogonally convex drawings. Recently, Chang et al. gave a necessary and sufficient condition for a plane graph to have an orthogonally convex drawing. In this paper, we show that if G satisfies the same condition given by Chang et al., it not only has an orthogonally convex drawing, but also a SSOD, which can be constructed in linear time. An orthogonal drawing D(G) is called an L-shaped drawing if each face of D(G) is an L-shaped polygon. In this paper we also show that an L-shaped orthogonal drawing can be constructed in O(n) time. The same algorithmic technique is used for solving both problems. It is based on regular edge labeling and is quite different from the methods used in previous results. Submitted: February 2016 Reviewed: June 2016 Revised: August 2016 Reviewed: September 2016 Revised: December 2016 Accepted: December 2016 Final: December 2016 Published: January 2017 Article type: Regular paper Communicated by: S.-H. Hong Research supported in part by NSF Grant CCR-1319732. An extended abstract of this paper, with title “Star Shaped Orthogonal Drawing”, was published in the proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC’2015), Lecture Notes in Computer Science 9076, pp. 137 149, May 2015. E-mail addresses: [email protected] (Xin He) [email protected] (Dayu He) 156 Xin He and Dayu He Starand L-Shaped Orthogonal Drawings

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges

Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an orthogonal path with one bend (an “L-shaped” edge). By giving new methods for drawing trees, we improve the bounds on the size of the point set P f...

متن کامل

Convex Drawings of Graphs with Non-convex Boundary

In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time.

متن کامل

Convex drawings of graphs with non-convex boundary constraints

In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. We also prove that every four-connected plane graph whose boundary is fixed with a crown-shaped polygon a...

متن کامل

Guarding orthogonal art galleries with sliding cameras

Let P be an orthogonal polygon with n vertices. A sliding camera travels back and forth along an orthogonal line segment s ⊆ P corresponding to its trajectory. The camera sees a point p ∈ P if there is a point q ∈ s such that pq is a line segment normal to s that is completely contained in P . In the MinimumCardinality Sliding Cameras (MCSC) problem, the objective is to find a set S of sliding ...

متن کامل

Synthesis and Characterization of Biodegradable Semi-Interpenetrating Polymer Networks Based on Star-Shaped Copolymers of ɛ-Caprolactone and Lactide

In this paper, the focus is on a new kind of biodegradable semi-interpenetrating polymer networks, which derived from ɛ-caprolactone, lactide, 1,4-butane diisocyanate and ethylenediamine and also its potential has been investigated in soft tissue engineering applications. The polymers were characterized by nuclear magnetic resonance (NMR) spectrometry, fourier transform infrared spectroscopy (F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Graph Algorithms Appl.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2017